package leetcode;

import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 东莞呵呵
 * Date:2022-07-21
 * Time:10:25
 */

public class TestDemo7 {
    int i=0;
    public TreeNode createTree(String str){
            TreeNode node=null;
            if(str.charAt(i)!='#'){
                node=new TreeNode(str.charAt(i));
                i++;
                node.left=createTree(str);
                node.right=createTree(str);
            }else {
                i++;
            }
            return node;

    }

    public void inOrder(TreeNode root){
        if(root==null){
            return ;
        }
        inOrder(root.left);
        System.out.println(root.val+" ");
        inOrder(root.right);
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextLine()) { // 注意 while 处理多个 case
           String str=in.nextLine();

        }
    }
}
